A short note on exponential-time algorithms for hybridization number
نویسندگان
چکیده
In this short note we prove that, given two (not necessarily binary) rooted phylogenetic trees T1, T2 on the same set of taxa X, where |X| = n, the hybridization number of T1 and T2 can be computed in time O∗(2n) i.e. O(2 · poly(n)). The result also means that a Maximum Acyclic Agreement Forest (MAAF) can be computed within the same time bound.
منابع مشابه
Combination of Transformed-means Clustering and Neural Networks for Short-Term Solar Radiation Forecasting
In order to provide an efficient conversion and utilization of solar power, solar radiation datashould be measured continuously and accurately over the long-term period. However, the measurement ofsolar radiation is not available to all countries in the world due to some technical and fiscal limitations. Hence,several studies were proposed in the literature to find mathematical and physical mod...
متن کاملOn the Time Complexity of Bucket Elimination Algorithms
In this short note, we prove the time complexity of full-bucket and mini-bucket elimination [1, 2]. In previous papers, when discussing the complexity of these algorithms, only the importance of the exponential contribution was emphasized and the rest of the contributions to the cost were not carefully considered. In this note, we address this fact and provide a non-trivial bound for the non-ex...
متن کاملOptimal Placement and Sizing of Fault Current Limiter in a Real Network: a Case Study (TECHNICAL NOTE)
In this paper, the effect of number and fault current limiter(FCL) location has been investigated in order to have maximum reduction of short circuit current level in all buses in a real network. To do so, the faulty buses were identified in terms of short circuit current level by computing short circuits on the desired network. Then, while the fault current limit was modeled, its optimal locat...
متن کاملAn Improved Particle Swarm Optimizer Based on a Novel Class of Fast and Efficient Learning Factors Strategies
The particle swarm optimizer (PSO) is a population-based metaheuristic optimization method that can be applied to a wide range of problems but it has the drawbacks like it easily falls into local optima and suffers from slow convergence in the later stages. In order to solve these problems, improved PSO (IPSO) variants, have been proposed. To bring about a balance between the exploration and ex...
متن کاملA short guide to exponential Krylov subspace time integration for Maxwell’s equationsI
The exponential time integration, i.e., time integration which involves the matrix exponential, is an attractive tool for solving Maxwell’s equations in time. However, its application in practice often requires a substantial knowledge of numerical linear algebra algorithms, in particular, of the Krylov subspace methods. This note provides a brief guide on how to apply exponential Krylov subspac...
متن کامل